Schematic Refutations of Formula Schemata
نویسندگان
چکیده
منابع مشابه
Causal Refutations of Idealism
In the ‘Refutation of Idealism’ chapter of the first ‘Critique’, Kant argues that the conditions required for having certain kinds of mental episodes are sufficient to guarantee that there are ‘objects in space’ outside us. A perennially influential way of reading this compressed argument is as a kind of causal inference: in order for us to make justified judgements about the order of our inner...
متن کاملCompressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers.
متن کاملA Resolution Calculus for Recursive Clause Sets [Preprint]
Proof schemata provide an alternative formalism for proofs containing an inductive argument, which allow an extension of Herbrand’s theorem and thus, the construction of Herbrand sequents and expansion trees. Existing proof transformation methods for proof schemata rely on constructing a recursive resolution refutation, a task which is highly non-trivial. An automated method for constructing su...
متن کاملA Resolution Calculus for Recursive Clause Sets
Proof schemata provide an alternative formalism for proofs containing an inductive argument, which allow an extension of Herbrand’s theorem and thus, the construction of Herbrand sequents and expansion trees. Existing proof transformation methods for proof schemata rely on constructing a recursive resolution refutation, a task which is highly non-trivial. An automated method for constructing su...
متن کاملVerifying Refutations with Extended Resolution
Modern SAT solvers use preprocessing and inprocessing techniques that are not solely based on resolution; existing unsatisfiability proof formats do not support SAT solvers using such techniques. We present a new proof format for checking unsatisfiability proofs produced by SAT solvers that use techniques such as extended resolution and blocked clause addition. Our new format was designed with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2020
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-020-09583-8